Projected Landweber iteration for matrix completion
نویسندگان
چکیده
منابع مشابه
Projected Landweber method and preconditioning
The projected Landweber method is an iterative method for solving constrained least-squares problems when the constraints are expressed in terms of a convex and closed set C. The convergence properties of the method have been recently investigated. Moreover, it has important applications to many problems of signal processing and image restoration. The practical difficulty is that the convergenc...
متن کاملA Modified Landweber Iteration Algorithm using Updated Sensitivity Matrix for Electrical Impedance Tomography
Electrical impedance tomography (EIT) is a technique to reconstruct the conductivity distribution of an inhomogeneous medium by injecting currents at the boundary of an object and measuring the resulting changes in voltage. The sensitivity matrix of EIT is calculated with a selected reference conductivity distribution, which is time-consuming. However, the sensitivity matrix will change with th...
متن کاملPreconditioning Landweber iteration in Hilbert scales
In this paper we investigate convergence of Landweber iteration in Hilbert scales for linear and nonlinear inverse problems. As opposed to the usual application of Hilbert scales in the framework of regularization methods, we focus here on the case s ≤ 0, which (for Tikhonov regularization) corresponds to regularization in a weaker norm. In this case, the Hilbert scale operator L−2s appearing i...
متن کاملA Compressive Landweber Iteration for Solving Ill-Posed Inverse Problems
In this paper we shall be concerned with the construction of an adaptive Landweber iteration for solving linear ill-posed and inverse problems. Classical Landweber iteration schemes provide in combination with suitable regularization parameter rules order optimal regularization schemes. However, for many applications the implementation of Landweber’s method is numerically very intensive. Theref...
متن کاملProjected Power Iteration for Network Alignment
The network alignment problem asks for the best correspondence between two given graphs, so that the largest possible number of edges are matched. This problem appears in many scientific problems (like the study of protein-protein interactions) and it is very closely related to the quadratic assignment problem which has graph isomorphism, traveling salesman and minimum bisection problems as par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2010
ISSN: 0377-0427
DOI: 10.1016/j.cam.2010.06.010